Semelfactives as atomic predicates

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coinductive Predicates as Final Coalgebras

We show that coinductive predicates expressing behavioural properties of infinite objects can be themselves expressed as final coalgebras in a category of relations. The well-known case of bisimulation will simply be a special case of such final predicates. We will show how some useful pointwise and mixed properties of streams can be modelled in this way.

متن کامل

Temporal Propositions as Vague Predicates

The idea that temporal propositions are vague predicates is examined with attention to the nature of the objects over which the predicates range. These objects should not, it is argued, be identified once and for all with points or intervals in the real line (or any fixed linear order). Context has an important role to play not only in sidestepping the Sorites paradox (Gaifman 2002) but also in...

متن کامل

Constructive Membership Predicates as Index Types

In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we motivate and explore this idea in the concrete setting of lists and trees. We show that the inhabitants of membership predicates are precisely the inhabitants of a generic shape type. We show that membership of x (of typ...

متن کامل

Refinement as Inclusion of Predicates over Programs

An approach to refinement is described: (1) formalize the syntax and semantics of the target programming language; (2) specify the requirements by defining a predicate over programs that characterizes the possible implementations; (3) refine the specification stepwise by defining monotonically decreasing predicates over programs, according to decisions that narrow down the possible implementati...

متن کامل

Security Type Systems as Recursive Predicates

We show how security type systems from the literature of languagebased noninterference can be represented more directly as predicates defined by structural recursion on the programs. In this context, we show how our uniform syntactic criteria from [7,8] cover several previous type-system soundness results. 1 Security type systems As in Example 2 from [7, 8], we assume that atomic statements and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: DELTA: Documentação de Estudos em Lingüística Teórica e Aplicada

سال: 2020

ISSN: 1678-460X,0102-4450

DOI: 10.1590/1678-460x2020360101